SORTING SUFFIXES OF TWO-PATTERN STRINGS
نویسندگان
چکیده
منابع مشابه
Sorting suffixes of two-pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial division of the suffixes of x into two sets: in step 1 sort the first set using recursive reduction of the problem, in step 2 determine the order of the suffixes in the second set based on the order of the suffixes in th...
متن کاملcontaining detail proofs for paper : Sorting suffixes of two - pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial division of the suffixes of x into two sets: in step 1 sort the first set using recursive reduction of the problem, in step 2 determine the order of the suffixes in the second set based on the order of the suffixes in th...
متن کاملA Java Pattern for Sorting Persian Strings
Sorting Persian strings is a common challenge for many users that develop web-based database applications. This issue occurs more frequently while using Persian data. To the best of our knowledge almost many versions of several DBMS do not support Persian strings sorting properly. In this paper we present a Java pattern for solving this issue. Our object-oriented solution consists of three clas...
متن کاملSorting Suffixes of a Text via its Lyndon Factorization
The process of sorting the suffixes of a text plays a fundamental role in Text Algorithms. They are used for instance in the constructions of the BurrowsWheeler transform and the suffix array, widely used in several fields of Computer Science. For this reason, several recent researches have been devoted to finding new strategies to obtain effective methods for such a sorting. In this paper we i...
متن کاملTwo-Pattern Strings — Computing Repetitions & Near-Repetitions
In a recent paper we introduced infinite two-pattern strings on the alphabet {a, b} as a generalization of Sturmian strings, and we posed three questions about them: • Given a finite string x, can we in linear time O(|x|) recognize whether or not x is a prefix/substring of some infinite two-pattern string? • If recognized as two-pattern, can all the repetitions in x be computed in linear time? ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2005
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054105003704